Automatic Decidability
نویسندگان
چکیده
We give a set of inference rules with constant constraints. Then we show how to extend a set of equational clauses, so that if the application of these inference rules halts on these clauses, then the theory is decidable by applying a standard set of Paramodulation inference rules. In addition, we can determine the number of clauses generated in this decision procedure. For some theories, such as the theory of lists, there are O(n lg(n)) clauses. For others it is polynomial. And for others it is simply exponential such as the theory of (extensional) arrays.
منابع مشابه
Decidability and Complexity in Automatic Monoids
We prove several complexity and decidability results for automatic monoids: (i) there exists an automatic monoid with a P-complete word problem, (ii) there exists an automatic monoid such that the firstorder theory of the corresponding Cayley-graph is not elementary decidable, and (iii) there exists an automatic monoid such that reachability in the corresponding Cayley-graph is undecidable. Mor...
متن کاملAdvice Automatic Structures and Uniformly Automatic Classes
We study structures that are automatic with advice. These are structures that admit a presentation by finite automata (over finite or infinite words or trees) with access to an additional input, called an advice. Over finite words, a standard example of a structure that is automatic with advice, but not automatic in the classical sense, is the additive group of rational numbers (Q,+). By using ...
متن کاملk-Automatic Sets of Rational Numbers
The notion of a k-automatic set of integers is well-studied. We develop a new notion — the k-automatic set of rational numbers — and prove basic properties of these sets, including closure properties and decidability.
متن کاملAutomatic Sets of Rational Numbers
The notion of a k-automatic set of integers is well-studied. We develop a new notion — the k-automatic set of rational numbers — and prove basic properties of these sets, including closure properties and decidability.
متن کاملAutomatic Decidability: A Schematic Calculus for Theories with Counting Operators
Many verification problems can be reduced to a satisfiability problem modulo theories. For building satisfiability procedures the rewriting-based approach uses a general calculus for equational reasoning named paramodulation. Schematic paramodulation, in turn, provides means to reason on the derivations computed by paramodulation. Until now, schematic paramodulation was only studied for standar...
متن کامل